An Improved Algorithm for Discounted Payoff Games
نویسنده
چکیده
We show that an optimal counterstrategy against a fixed positional strategy in a generalized discounted payoff game, where edges have individual discounts, can be computed in O(mn logm) strongly polynomial time, where n and m are the number of vertices and edges in the game graph. This results in the best known strongly subexponential time bound for solving two-player generalized discounted payoff games.
منابع مشابه
Symmetric Strategy Improvement
Symmetry is inherent in the definition of most of the two-player zero-sum games, including parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that no symmetric analysis techniques for these games exist. We develop a novel symmetric strategy improvement algorithm where, in each iteration, the strategies of both players are improved simultaneously. We show that sym...
متن کاملQuantitative Fair Simulation Gamest
Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simula...
متن کاملFast Algorithms for Monotonic Discounted Linear Programs with Two Variables per Inequality∗
We suggest new strongly polynomial algorithms for solving linear programs min( ∑ xi|S) with constraints S of the monotonic discounted form xi ≥ λxj + β with 0 < λ < 1. The algorithm for the case when the discounting factor λ is equal for all constraints is O(mn2), whereas the algorithm for the case when λ may vary between the constraints is O(mn2 logm), where n is the number of variables and m ...
متن کاملSimple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems1
We show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Using this formulation, and the known algorithm of Sharir and Welzl [SW] for LP-type problems, we obtain the first strongly subexponential solution for SSGs (a strongly subexponential algorithm has only been known for binary SSGs [L]). Using known reductions between various games, we achieve the first strongly ...
متن کاملApplying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games
We define and examine priority mean-payoff games — a natural extension of parity games. By adapting the notion of Blackwell optimality borrowed from the theory of Markov decision processes we show that priority mean-payoff games can be seen as a limit of special multi-discounted games.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006